Optimal network compression
نویسندگان
چکیده
This paper introduces a formulation of the optimal network compression problem for financial systems. general is presented different levels or rerouting allowed from initial interbank network. We prove that this is, generically, NP-hard. focus on objective functions generated by systemic risk measures under shocks to use framework study (sub)optimality maximally compressed conclude studying specific networks; permits us study, e.g., so-called robust fragility certain topologies more generally as well potential benefits and costs compression. In particular, systematic heterogeneous networks results Acemoglu, Ozdaglar, Tahbaz-Salehi (2015) no longer hold generally.
منابع مشابه
The optimal sequence compression
This paper presents the optimal compression for sequences with undefined values. Let we have (N −m) undefined and m defined positions in the boolean sequence −→ V of length N . The sequence code length can’t be less then m in general case, otherwise at least two sequences will have the same code. We present the coding algorithm which generates codes of almost m length, i.e. almost equal to the ...
متن کاملOptimal top dag compression
It is shown that for a given ordered node-labelled tree of size $n$ and with $s$ many different node labels, one can construct in linear time a top dag of height $O(\log n)$ and size $O(n / \log_\sigma n) \cap O(d \cdot \log n)$, where $\sigma = \max\{ 2, s\}$ and $d$ is the size of the minimal dag. The size bound $O(n / \log_\sigma n)$ is optimal and improves on previous bounds.
متن کاملNear-Optimal (Euclidean) Metric Compression
The metric sketching problem is defined as follows. Given a metric on n points, and > 0, we wish to produce a small size data structure (sketch) that, given any pair of point indices, recovers the distance between the points up to a 1 + distortion. In this paper we consider metrics induced by `2 and `1 norms whose spread (the ratio of the diameter to the closest pair distance) is bounded by Φ >...
متن کاملError-Resilient Optimal Data Compression
The problem of communication and computation in the presence of errors is difficult, and general solutions can be time consuming and inflexible (particularly when implemented with a prescribed error detection/correction). A reasonable approach is to investigate reliable communication in carefully selected areas of fundamental interest where specific solutions may be more practical than general ...
متن کاملBit-Optimal Lempel-Ziv compression
One of the most famous and investigated lossless data-compression scheme is the one introduced by Lempel and Ziv about 40 years ago [23]. This compression scheme is known as ”dictionary-based compression” and consists of squeezing an input string by replacing some of its substrings with (shorter) codewords which are actually pointers to a dictionary of phrases built as the string is processed. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2023
ISSN: ['1872-6860', '0377-2217']
DOI: https://doi.org/10.1016/j.ejor.2022.07.026